Characterization of reachable/nonreachable cellular automata statesDAS, Sukanta; SIKDAR, Biplab K; PAL CHAUDHURI, P et al.Lecture notes in computer science. 2004, pp 813-822, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

Unification & sharing in timed automata verificationDAVID, Alexandre; BEHRMANN, Gerd; LARSEN, Kim G et al.Lecture notes in computer science. 2003, pp 225-229, issn 0302-9743, isbn 3-540-40117-2, 5 p.Conference Paper

Monitoring of Timed Discrete Events Systems With InterruptsALLAHHAM, Adib; ALLA, Hassane.IEEE transactions on automation science and engineering. 2010, Vol 7, Num 1, pp 146-150, issn 1545-5955, 5 p.Article

Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systemsKAYNAMA, Shahab; OISHI, Meeko.International journal of control. 2011, Vol 84, Num 1-3, pp 165-179, issn 0020-7179, 15 p.Article

A necessary and sufficient condition for the liveness and reversibility of process- resource nets with acyclic, quasi-live, serializable, and reversible process subnetsREVELIOTIS, Spyros.IEEE transactions on automation science and engineering. 2006, Vol 3, Num 4, pp 462-468, issn 1545-5955, 7 p.Article

High level petri nets analysis with helenaEVANGELISTA, Sami.Lecture notes in computer science. 2005, pp 455-464, issn 0302-9743, isbn 3-540-26301-2, 10 p.Conference Paper

One approximation to the reachable sets of strongly convex differential inclusionsPULOVA, Nedka; PULOV, Vladimir.Lecture notes in computer science. 2004, pp 270-275, issn 0302-9743, isbn 3-540-21090-3, 6 p.Conference Paper

Kronecker Algebra and (Stochastic) petri nets: Is it worth the effort?DONATELLI, Susanna.Lecture notes in computer science. 2001, pp 1-18, issn 0302-9743, isbn 3-540-42252-8Conference Paper

Incremental verification by abstractionLAKHNECH, Y; BENSALEM, S; BEREZIN, S et al.Lecture notes in computer science. 2001, pp 98-112, issn 0302-9743, isbn 3-540-41865-2Conference Paper

An abstraction algorithm for the verification of generalized C-slow designsBAUMGARTNER, J; TRIPP, A; AZIZ, A et al.Lecture notes in computer science. 2000, pp 5-19, issn 0302-9743, isbn 3-540-67770-4Conference Paper

Experimental comparison of call string and functional approaches to interprocedural analysisMARTIN, F.Lecture notes in computer science. 1999, pp 63-75, issn 0302-9743, isbn 3-540-65717-7Conference Paper

On-the-fly verification of linear temporal logicCOUVREUR, J.-M.Lecture notes in computer science. 1999, pp 253-271, issn 0302-9743, isbn 3-540-66587-0, 2VolConference Paper

Space-time tradeoffs for graph propertiesDODIS, Y; KHANNA, S.Lecture notes in computer science. 1999, pp 291-300, issn 0302-9743, isbn 3-540-66224-3Conference Paper

The game of the name in cryptographic tablesAMADIO, R. M; PRASAD, S.Lecture notes in computer science. 1999, pp 15-26, issn 0302-9743, isbn 3-540-66856-XConference Paper

Verification of hierarchical state/event systems using reusability and compositionalityBEHRMANN, G; LARSEN, K. G; ANDERSEN, H. R et al.Lecture notes in computer science. 1999, pp 163-177, issn 0302-9743, isbn 3-540-65703-7Conference Paper

Deciding bisimulation-like equivalences with finite-state processesJANCAR, P; KUCERA, A; MAYR, R et al.Lecture notes in computer science. 1998, pp 200-211, issn 0302-9743, isbn 3-540-64781-3Conference Paper

A logical reconstruction of reachabilityRYBINA, Tatiana; VORONKOV, Andrei.Lecture notes in computer science. 2003, pp 222-237, issn 0302-9743, isbn 3-540-20813-5, 16 p.Conference Paper

Abstracting WS1S systems to verify parameterized networksBAUKUS, K; BENSALEM, S; LAKHNECH, Y et al.Lecture notes in computer science. 2000, pp 188-203, issn 0302-9743, isbn 3-540-67282-6Conference Paper

Normed simulationsGRIFFIOEN, D; VAANDRAGER, F.Lecture notes in computer science. 1998, pp 332-344, issn 0302-9743, isbn 3-540-64608-6Conference Paper

Reset nets between decidability and undecidabilityDUFOURD, C; FINKEL, A; SCHNOEBELEN, P et al.Lecture notes in computer science. 1998, pp 103-115, issn 0302-9743, isbn 3-540-64781-3Conference Paper

Controlled reachability analysis in AI planning : Theory and practiceZEMALI, Yacine.Lecture notes in computer science. 2005, pp 264-278, issn 0302-9743, isbn 3-540-28761-2, 15 p.Conference Paper

AsmL Specification and Verification of Lamport's Bakery AlgorithmBOTINCAN, Matko.Information technology interfaces. 2005, pp 617-623, isbn 953-7138-02-X, 1Vol, 7 p.Conference Paper

Reachability analysis in T-invariant-less Petri netsKOSTIN, Alexander E.IEEE transactions on automatic control. 2003, Vol 48, Num 6, pp 1019-1024, issn 0018-9286, 6 p.Article

On one-pass term rewritingFÜLÖP, Z; JURVANEN, E; STEINBY, M et al.Lecture notes in computer science. 1998, pp 248-256, issn 0302-9743, isbn 3-540-64827-5Conference Paper